AC network-constrained unit commitment via conic relaxation and convex programming

To address the AC network-constrained unit commitment problem, we propose an effective three-step solution approach. We first solve a DC (mixed-integer linear) approximation of original problem to identify initial and set transmission lines likely be congested. Secondly, with linear as starting point, mixed-integer second-order conic relaxation using active strategy regarding constraints. Finally, relaxed increasingly accurate continuous convex optimization problems ensure full feasibility. show effectiveness proposed approach IEEE 24-bus test system Illinois 200-bus 49 generators 245 lines.